Dartagnan: SMT-based Violation Witness Validation (Competition Contribution)
نویسندگان
چکیده
Abstract The validation of violation witnesses is an important step during software verification. It hides false alarms raised by verifiers from engineers, which in turn helps them concentrate on critical issues and improves the verification experience. Until 2021 edition Competition Software Verification ( SV-COMP ), CPAchecker was only witness validator for ConcurrencySafety category. This article describes how we extended Dartagnan verifier to support witnesses. results 2022 competition show that, generated different verifiers, succeeds where does not. Our extension thus possibilities overall competition. We discuss ’s strengths weaknesses as a tool describe possible ways improve it future.
منابع مشابه
The 2012 SMT Competition
The 2012 SMT Competition was held in conjunction with the SMT workshop at IJCAR 2012. Eleven solvers participated, showing improvements over 2011 in some but not all divisions. The competition featured a new unsat-core-generation track and encouraged the demonstration of proof-generation solvers. The series of competitions is expected to be continued at SAT 2013.
متن کاملSMT-Based Validation of Timed Failure Propagation Graphs
Timed Failure Propagation Graphs (TFPGs) are a formalism used in industry to describe failure propagation in a dynamic partially observable system. TFPGs are commonly used to perform model-based diagnosis. As in any model-based diagnosis approach, however, the quality of the diagnosis strongly depends on the quality of the model. Approaches to certify the quality of the TFPG are limited and mai...
متن کاملBoolector at the SMT Competition 2015
This paper serves as solver description for our SMT solver Boolector, entering the SMT Competition 2015 in three different configurations. We only list important differences to the earlier version of Boolector that participated in the SMT Competition 2014 [2]. For further information we refer to [3] or source code.
متن کاملBoolector at the SMT Competition 2016
This paper serves as solver description for our SMT solver Boolector, entering the SMT Competition 2016 in two different configurations. We only list important differences to earlier version of Boolector in the SMT Competition 2015 [3]. For further information we refer to [2] or source code.
متن کاملBoolector at the SMT Competition 2014
This paper serves as solver description for our SMT solver Boolector entering the SMT Competition 2014 in three different configurations. We only list important differences to the earlier version of Boolector that participated in the SMT Competition 2012 [2]. For further information we refer to [2] or source code.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-99527-0_24